General Error Locator Polynomials for Binary Cyclic Codes With t<=2 and n<63
نویسندگان
چکیده
We show that a recently proposed algorithm ([9]) for decoding cyclic codes may be applied efficiently to all binary cyclic codes with t ≤ 2 and n < 63.
منابع مشابه
On a class of optimal nonbinary linear unequal-error-protection codes for two sets of messages
We intraduce the n-dimensional key equation, which exhibitsthe error-locator polynomial of an n-dimensional cyclic code as a productof n univariate polynomials and the error-evaluator polynomial as an n-variable polynomial. We then reinterpret these polynomials in the contextof linear recurring sequences. In particular, we reduce the decodingproblem to successive application...
متن کاملStudying the locator polynomials of minimum weight codewords of BCH codes
We consider only primitive binary cyclic codes of length n = 2 m ? 1. A BCH-code with designed distance is denoted B(n;). A BCH-code is always a narrow-sense BCH-code. A codeword is identiied with its locator polynomial, whose coeecients are the symmetric functions of the locators. The deenition of the code by its zeros-set involves some properties for the power sums of the locators. Moreover t...
متن کاملThe minimum distance of some binary codes via the Newton's identities
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of given weight. The method is based on the manipulation of the locators and of the locator polynomial of a codeword x. Because of the dimensions of the problem, we need to use a symbolic computation software, like Maple or Scratchpad II. The method can be ineeective when the length is too large. The pa...
متن کاملImproved decoding of affine–variety codes
We provide a decoding technique for affine-variety codes using a multidimensional extension of general error locator polynomials. We prove the existence of such polynomials for any affine-variety code and hence for any linear code. We compute some interesting cases, including Hermitian codes.
متن کاملCRC Codes for Error Control 1
Cyclic Redundancy-Check (CRC) codes are shortened binary cyclic codes that are widely used for error detection on digital communication links and data storage. Unfortunately, many of the standardized CRC polynomials provide less error detection capability than they might. In this work a survey on the published results about the error detection performance of CRC codes of up to 16 bit redundancy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 53 شماره
صفحات -
تاریخ انتشار 2007